Generalizations of Mazurkiewicz Traces
ثبت نشده
چکیده
This Master's Thesis represents the nal part of my computer science study in Leiden. I would like to thank my supervisor Jetty Kleijn for her support.
منابع مشابه
A General Categorical Connection between Local Event Structures and Local Traces
Local event structures and local traces are generalizations of the classical prime event structures and Mazurkiewicz’ traces in which independence is no longer a global binary property. We consider the problem of lifting the categorical connection between prime event structures and Mazurkiewicz’ traces to this more general setting. Using a generic approach it is shown how certain subcategories ...
متن کاملOn First-Order Fragments for Words and Mazurkiewicz Traces A Survey
We summarize several characterizations, inclusions, and separations on fragments of first-order logic over words and Mazurkiewicz traces. The results concerning Mazurkiewicz traces can be seen as generalizations of those for words. It turns out that over traces it is crucial, how easy concurrency can be expressed. Since there is no concurrency in words, this distinction does not occur there. In...
متن کاملLogics for Mazurkiewicz traces
Linear temporal logic (LTL) has become a well established tool for specifying the dynamic behavior of reactive systems with an interleaving semantics and the automatatheoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alternating automata turned out to be a powerful tool in constructing efficient yet simple to understand ...
متن کاملDagstuhl Seminar on Logic, Algebra, and Formal Verification of Concurrent Systems
s of the Talks 6 Pascal Weil Recognizability and regularity for languages of series-parallel pomsets . . . . . . . . . . . . . 6 Lenore Zuck Automatic Deductive Verification with Invisible Invariants . . 7 Manfred Droste Process Cost Functions for Concurrent Systems . . . . . . . . 7 Doron Peled Black Box Checking . . . . . . . . . . . . . . . . . . . . . . . . 8 Rémi Morin On Rational Message ...
متن کاملDeciding LTL over Mazurkiewicz Traces
Linear time temporal logic (LTL) has become a well established tool for specifying the dynamic behaviour of reactive systems with an interleaving semantics, and the automata-theoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alternating automata turned out to be a powerful tool in constructing efficient yet simple to und...
متن کامل